On the convergence of the inverses of Toeplitz matrices and its applications
نویسندگان
چکیده
Many issues in signal processing involve the inverses of Toeplitz matrices. One widely used technique is to replace Toeplitz matrices with their associated circulant matrices, based on the well-known fact that Toeplitz matrices asymptotically converge to their associated circulant matrices in the weak sense. This often leads to considerable simplification. However, it is well known that such a weak convergence cannot be strengthened into strong convergence. It is this fact that severely limits the usefulness of the close relation between Toeplitz matrices and circulant matrices. Observing that communication receiver design often needs to seek optimality in regard to a data sequence transmitted within finite duration, we define the finite-term strong convergence regarding two families of matrices. We present a condition under which the inverses of a Toeplitz matrix converges in the strong sense to a circulant matrix for finite-term quadratic forms. This builds a critical link in the application of the convergence theorems for the inverses of Toeplitz matrices since the weak convergence generally finds its usefulness in issues associated with minimum mean squared error and the finite-term strong convergence is useful in issues associated with the maximum-likelihood or maximum a posteriori principles.
منابع مشابه
A Homotopic/Factorization Process for Toeplitz-like Matrices with Newton’s/Conjugate Gradient Stages
We modify our earlier homotopic process for iterative inversion of Toeplitz and Toeplitz-like matrices to improve the choice of the initial approximate inverses at every homotopic step. This enables us to control the condition of the auxiliary matrices and to accelerate convergence substantially. The algorithm extends our older approach where the input matrix was factorized into the product of ...
متن کاملModified Newton’s Algorithm for Computing the Group Inverses of Singular Toeplitz Matrices
Newton’s iteration is modified for the computation of the group inverses of singular Toeplitz matrices. At each iteration, the iteration matrix is approximated by a matrix with a low displacement rank. Because of the displacement structure of the iteration matrix, the matrix-vector multiplication involved in Newton’s iteration can be done efficiently. We show that the convergence of the modifie...
متن کاملAn application of Fibonacci numbers into infinite Toeplitz matrices
The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p
متن کاملNorms of Inverses, Spectra, and Pseudospectra of Large Truncated Wiener-Hopf Operators and Toeplitz Matrices
This paper is concerned with Wiener-Hopf integral operators on Lp and with Toeplitz operators (or matrices) on lp. The symbols of the operators are assumed to be continuous matrix functions. It is well known that the invertibility of the operator itself and of its associated operator imply the invertibility of all sufficiently large truncations and the uniform boundedness of the norms of their ...
متن کاملBounds for Inverses of Triangular Toeplitz Matrices
This short note provides an improvement on a recent result of Vecchio on a norm bound for the inverse of a lower triangular Toeplitz matrix with nonnegative entries. A sharper asymptotic bound is obtained as well as a version for matrices of finite order. The results are shown to be nearly best possible under the given constraints. 1. Introduction. This paper provides an improvement on a recent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003